A Conflict-based Operator for Mapping Revision
نویسندگان
چکیده
Ontology matching is one of the key research topics in the field of the Semantic Web. There are many matching systems that generate mappings between different ontologies either automatically or semiautomatically. However, the mappings generated by these systems may be inconsistent with the ontologies. Several approaches have been proposed to deal with the inconsistencies between mappings and ontologies. This problem is often called a mapping revision problem because we give priority to ontologies when resolving inconsistencies. In this paper, we first propose a conflict-based mapping revision operator and show that it can be characterized by a logical postulate. We then provide an iterative algorithm for mapping revision by using an ontology revision operator and show that this algorithm defines a conflict-based mapping revision operator. Three concrete ontology revision operators are given to instantiate the iterative algorithm, which result in three different mapping revision algorithms. We implement these algorithms and provide some preliminary but interesting evaluation results.
منابع مشابه
A Conflict-based Operator for Mapping Revision Theory and Implementation
Ontology matching is one of the key research topics in the field of the Semantic Web. There are many matching systems that generate mappings between different ontologies either automatically or semiautomatically. However, the mappings generated by these systems may be inconsistent with the ontologies. Several approaches have been proposed to deal with the inconsistencies between mappings and on...
متن کاملA Revision-Based Approach to Resolving Conflicting Information
In this paper, we propose a revision-based approach for conflict resolution by generalizing the Disjunctive Maxi-Adjustment (DMA) approach (Benferhat et al. 2004). Revision operators can be classified into two different families: the model-based ones and the formula-based ones. So the revision-based approach has two different versions according to which family of revision operators is chosen. T...
متن کاملBelief Revision with Bridging Axioms
Belief revision deals with the problem of changing a declaratively specified repository under potentially conflicting information. Usually, the problem is approached by providing postulates that specify intended constraints for the revision and constructing concrete revision operators fulfilling them. In the last 30 years since the start of formal belief revision with the work of AGM (Alchourro...
متن کاملA Kernel Revision Operator for Terminologies - Algorithms and Evaluation
Revision of a description logic-based ontology deals with the problem of incorporating newly received information consistently. In this paper, we propose a general operator for revising terminologies in description logic-based ontologies. Our revision operator relies on a reformulation of the kernel contraction operator in belief revision. We first define our revision operator for terminologies...
متن کاملConflict-Based Belief Revision Operators in Possibilistic Logic
In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...
متن کامل